Self timed division and square-root extraction
نویسندگان
چکیده
This paper describes a self-timed integrated circuit for division and square-root extraction. First it concentrates on the development and the proof of a new mathematical algorithm. Then the design methodology and the architecture of a self-timed circuit implementing a simplified version of the algorithm is presented. The algorithm relies on two functional blocks, each simple enough to be fully detailed at the logic level in this paper. Besides its simplicity, the novelty of the algorithm lies in the fact that it delivers the quotient or the square root in conventional binary notation. The final remainder only has to be eventually converted.
منابع مشابه
A New Asynchronous Pipeline Scheme : Application to the Design of a Self-timed Ring Divider
This paper describes an efficient way to synchronise and pipeline asynchronous circuits built out of precharged function blocks. Differential Cascode Voltage Switch Logic (DCVSL) [1] is used to efficiently implement these blocks. A modified version of this logic, called LCDL (Latched CMOS Differential Logic [2]), or DCVSL with NORA-Latch [3] in the literature, is used in order to improve the st...
متن کاملSoftware Division and Square Root Using Goldschmidt’s Algorithms
Goldschmidt’s Algorithms for division and square root are often characterized as being useful for hardware implementation, and lacking self-correction. A reexamination of these algorithms show that there are good software counterparts that retain the speed advantage of Goldschmidt’s Algorithm over the Newton-Raphson iteration. A final step is needed, however, to get the last bit rounded correctly.
متن کاملA clinical review of external apical root resorption and self-repair of maxillary incisors after orthodontic treatment
The purpose of this study was to investigate the degree of root resorption after orthodontic treatment and self-repair of the root following two years of retention by measuring the root length of the maxillary incisors before, immediately after and two years after orthodontic treatment. Sixty patients with Angle Class II division 1 malocclusion ranging in age from 12 to 22 who were treated with...
متن کاملFast low-power shared division and square-root architecture
This paper addresses a fast low-power implementation of a shared division and square-root architecture. Two approaches are considered in this paper; these include the SRT (Sweeney, Robertson and Tocher) approach which does not require prescaling and the GST (generalized Svoboda and Tung) approach which requires prescaling of the operands. This paper makes two important contributions. Although S...
متن کاملHigh-Speed Double-Precision Computation of Reciprocal, Division, Square Root and Inverse Square Root
A new method for the high-speed computation of double-precision floating-point reciprocal, division, square root, and inverse square root operations is presented in this paper. This method employs a second-degree minimax polynomial approximation to obtain an accurate initial estimate of the reciprocal and the inverse square root values, and then performs a modified Goldschmidt iteration. The hi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996